Joint Eigenvalue Decomposition Using Polar Matrix Factorization
نویسندگان
چکیده
In this paper we propose a new algorithm for the joint eigenvalue decomposition of a set of real non-defective matrices. Our approach resorts to a Jacobi-like procedure based on polar matrix decomposition. We introduce a new criterion in this context for the optimization of the hyperbolic matrices, giving birth to an original algorithm called JDTM. This algorithm is described in detail and a comparison study with reference algorithms is performed. Comparison results show that our approach provides quicker and more accurate results in all the considered situations.
منابع مشابه
A new approach for building recommender system using non negative matrix factorization method
Nonnegative Matrix Factorization is a new approach to reduce data dimensions. In this method, by applying the nonnegativity of the matrix data, the matrix is decomposed into components that are more interrelated and divide the data into sections where the data in these sections have a specific relationship. In this paper, we use the nonnegative matrix factorization to decompose the user ratin...
متن کاملStable and Efficient Spectral Divide and Conquer Algorithms for the Symmetric Eigenvalue Decomposition and the SVD
Spectral divide and conquer algorithms solve the eigenvalue problem by recursively computing an invariant subspace for a subset of the spectrum and using it to decouple the problem into two smaller subproblems. A number of such algorithms have been developed over the last forty years, often motivated by parallel computing and, most recently, with the aim of achieving minimal communication costs...
متن کاملFinding the polar decomposition of a matrix by an efficient iterative method
Theobjective in this paper to study and present a new iterative method possessing high convergence order for calculating the polar decompostion of a matrix. To do this, it is shown that the new scheme is convergent and has high convergence. The analytical results are upheld via numerical simulations and comparisons.
متن کاملNumerical Methods for the Tridiagonal Hyperbolic Quadratic Eigenvalue Problem
We consider numerical methods for the computation of the eigenvalues of the tridiagonal hyperbolic quadratic eigenvalue problem. The eigenvalues are computed as zeros of the characteristic polynomial using the bisection, Laguerre’s method, the Ehrlich–Aberth method, and the Durand–Kerner method. Initial approximations are provided by a divide-and-conquer approach using rank two modifications. T...
متن کاملA New Multichannel Spectral Factorization Algorithm for Parahermitian Polynomial Matrices
Abstract—A novel multichannel spectral factorization algorithm is illustrated in this paper. This new algorithm is based on an iterative method for polynomial eigenvalue decomposition (PEVD) called the second order sequential best rotation (SBR2) algorithm [1]. By using the SBR2 algorithm, multichannel spectral factorization problems are simply broken down to a set of single channel problems wh...
متن کامل